- Primitive Function Name
- Programming: PFN
Универсальный русско-английский словарь. Академик.ру. 2011.
Primitive Function Name
Смотреть что такое "Primitive Function Name" в других словарях:
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Name — For other uses, see Name (disambiguation). Ceremonies, such as baptism, can be used to give names. A name is a word or term used for identification. Names can identify a class or category of things, or a single thing, either uniquely, or within a … Wikipedia
Microsoft Visual C++ Name Mangling — is a mangling (decoration) scheme used in Microsoft Visual C++ series of compilers. It provides a way of encoding name and additional information about a function, structure, class or another datatype in order to pass more semantic information… … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
Dirichlet L-function — In mathematics, a Dirichlet L series is a function of the form Here χ is a Dirichlet character and s a complex variable with real part greater than 1. By analytic continuation, this function can be extended to a meromorphic function on the whole… … Wikipedia
Variadic function — In computer programming, a variadic function is a function of variable arity; that is, one which can take different numbers of arguments. Support for variadic functions differs widely among programming languages.There are many mathematical and… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Divisor function — σ0(n) up to n = 250 Sigma function σ … Wikipedia
Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger … Wikipedia
Domain of a function — Venn diagram showing f, a function from domain X to codomain Y. The smaller oval inside Y is the image of f, sometimes called the range of f. In mathematics, the domain of definition or simply the domain of a function is the set of input or… … Wikipedia
Cubic function — This article is about cubic equations in one variable. For cubic equations in two variables, see elliptic curve. Graph of a cubic function with 3 real roots (where the curve crosses the horizontal axis where y = 0). It has 2 critical points. Here … Wikipedia
